On the Foundations of Grounding in Answer Set Programming

On the Foundations of Answer Set Programming

Schlipf (Schlipf 1995) proved that the Stable Logic Programming solves all NP decision problems. We extend Schlipf’s result to all search problems in the class NP. Moreover, we do this in a uniform way as defined in (Marek & Truszczyfiski 1999). Specifically, we show that there is a single DATALOG ~ program Pr~ so that for every Turing machine T, every polynomial with nonnegative coedicients p,...

Grounding and Solving in Answer Set Programming

modeling language with effective grounding and solving technology. Moreover, ASP is highly versatile by offering various elaborate language constructs and a whole spectrum of reasoning modes. The work flow of ASP is illustrated in figure 1. At first, a problem is expressed as a logic program. A grounder systematically replaces all variables in the program by (variable-free) terms, and the solve...

GASP: Answer Set Programming with Lazy Grounding

In this paper we present a novel methodology to compute stable models in Answer Set Programming. The process is performed with a bottom-up approach that does not require the preprocessing of the typical grounding phase. The implementation is completely in Prolog and Constraint Logic Programming over finite domains.

Mathematical Foundations of Answer Set Programming

Automated Selection of Grounding Algorithm in Answer Set Programming

Answer Set Programming (ASP) is a powerful language for knowledge representation and reasoning. ASP is exploited in real-world applications and is also attracting the interest of industry thanks to the availability of efficient implementations. ASP systems compute solutions relying on two modules: a grounder that produces, by removing variables from the rules, a ground program equivalent to the...